The Lazy Bureaucrat scheduling problem
نویسندگان
چکیده
منابع مشابه
The Lazy Bureaucrat Scheduling Problem
We introduce a new class of scheduling problems in which the optimization is performed by the worker (single “machine”) who performs the tasks. A typical worker’s objective is to minimize the amount of work he does (he is “lazy”), or more generally, to schedule as inefficiently (in some sense) as possible. The worker is subject to the constraint that he must be busy when there is work that he c...
متن کاملNew Results for Lazy Bureaucrat Scheduling Problem
Lazy bureaucrat scheduling is a new class of scheduling problems that was introduced in 1]. In this class of scheduling problems, there is one employee (or more) who should perform the assigned jobs; the objective of the employee is to minimize the amount of work he does and be as ineecient as possible (he is \Lazy"). He is subject to a constraint that he should be busy when there is work to be...
متن کاملCommon-Deadline Lazy Bureaucrat Scheduling Problems
The lazy bureaucrat scheduling is a new class of scheduling problems that was introduced in [1]. In these problems, there is one employee (or more) who should perform the assigned jobs. The objective of the employee is to minimize the amount of work he performs and to be as inefficient as possible. He is subject to a constraint, however, that he should be busy when there is some work to do. In ...
متن کاملThe Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design
We study the Lazy Bureaucrat scheduling problem (Arkin, Bender, Mitchell and Skiena [1]) in the case of common arrivals and deadlines. In this case the goal is to select a subset of given jobs in such a way that the total processing time is minimized and no other job can fit into the schedule. Our contribution comprises a linear time 4/3-approximation algorithm and an FPTAS, which respectively ...
متن کاملThe Lazy Matroid Problem
This article introduces the lazy matroid problem, which captures the goal of saving time or money in certain task selection scenarios. We are given a budget B and a matroid M with weights on its elements. The problem consists in finding an independent set F of minimum weight. In addition, F is feasible if its augmentation with any new element x implies that either F + x exceeds B or F + x is de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2003
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00060-9